Dynamic controllability via Timed Game Automata
نویسندگان
چکیده
منابع مشابه
A Game Approach to Determinize Timed Automata
Timed automata are a usual model for the specification of real time systems. Their determinization is a key issue for several problems such as implementability, diagnosis or test generation. There exist non-determinizable timed automata and, unfortunately, determinizability of timed automata is an undecidable problem. Recently, two approaches have been proposed: a determinization procedure [2] ...
متن کاملGame Characterizations of Timed Relations for Timed Automata Processes
In this work, we design the game semantics for timed equivalences and preorders of timed processes. The timed games corresponding to the various timed relations form a hierarchy. These games are similar to Stirling’s bisimulation games. If it is the case that the existence of a winning strategy for the defender in a game G1 implies that there exists a winning strategy for the defender in anothe...
متن کاملOptimal Strategies in Priced Timed Game Automata
Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove in addition that it is decida...
متن کاملDynamic Clock Elimination in Parametric Timed Automata
The formalism of parametric timed automata provides designers with a formal way to specify and verify real-time concurrent systems where timing requirements are unknown (or parameters). Such models are usually subject to the state space explosion. A popular way to partially reduce the size of the state space is to reduce the number of clock variables. In this work, we present a technique for dy...
متن کاملVerification of Timed Automata via Satisfiability Checking
In this paper we show how to translate bounded-length verification problems for timed automata into formulae in difference logic, a propositional logic enriched with timing constraints. We describe the principles of a satisfiability checker specialized for this logic that we have implemented and report some preliminary experimental results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2016
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-016-0257-2